Convex Bodies and Concave Functions

Convex and concave relaxations of implicit functions

Chasing Convex Bodies and Functions

We consider three related online problems: Online Convex Optimization, Convex Body Chasing, and Lazy Convex Body Chasing. In Online Convex Optimization the input is an online sequence of convex functions over some Euclidean space. In response to a function, the online algorithm can move to any destination point in the Euclidean space. The cost is the total distance moved plus the sum of the fun...

On convex-concave perception based functions

Perception based function (PBF) is given by the set of rules Ri:“If X is Ti then Y is Si”, where Ti is a linguistic term describing some fuzzy intervals Ai on the domain of real values of X and Si is a linguistic description of the shape of the function Y(X) on this interval. The methods of explicitation of such type of rules when Si are given by words QUICKLY INCREASING AND SLIGHTLY CONVEX, SL...

Short Proofs of the Separation Theorems for L-convex/concave and M-convex/concave Functions

Recently K. Murota has introduced concepts of L-convex function and Mconvex function as generalizations of those of submodular function and base polyhedron, respectively, and has shown separation theorems for L-convex/concave functions and for M-convex/concave functions. The present note gives short alternative proofs of the separation theorems by relating them to the ordinary separation theore...

On Self-Concordant Convex-Concave Functions

In this paper, we introduce the notion of a self-concordant convex-concave function, establish basic properties of these functions and develop a path-following interior point method for approximating saddle points of “good enough” convex-concave functions – those which admit natural self-concordant convex-concave regularizations. The approach is illustrated by its applications to developing an ...